import java.util.Comparator;
import java.util.PriorityQueue;

class IntCompare implements Comparator<Integer> {

    @Override
    public int compare(Integer o1, Integer o2) {
        return o2.compareTo(o1);
    }
}


public class Test {

    public int[] smallestK(int[] arr, int k) {
        int[] ret = new int[k];
        if(k == 0 || arr.length == 0){
            return ret;
        }
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(k,new IntCompare());

        //O(klogk)
        for (int i = 0; i < k; i++) {
         priorityQueue.offer(arr[i]);
        }

        //O((n-k)logk)
        for (int i = k; i < arr.length ; i++) {
            int peekVal = priorityQueue.peek();
            if(arr[i] < peekVal){
                priorityQueue.poll();
                priorityQueue.offer(arr[i]);
            }
        }
        
        for (int i = 0; i < k; i++) {
            ret[i] = priorityQueue.poll();
        }

        return ret;

    }


    public int[] smallestK2(int[] arr, int k) {
        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>();
        for (int i = 0; i < arr.length; i++) {
            priorityQueue.offer(arr[i]);
        }

        int[] ret = new int[k];

        for (int i = 0; i < k; i++) {
            ret[i] = priorityQueue.poll();
        }

        return ret;
    }
    public static void main1(String[] args) {
        int[] array =  { 27,15,19,18,28,34,65,49,25,37};
        HeapTest heapTest = new HeapTest();
        heapTest.init(array);
        heapTest.createHeap();

        // heapTest.offer(80);

        heapTest.poll();

    }
}
